Time for secrecy

Time to lift the veil of secrecy.

Secrecy logic: S -secrecy structures

Let S = 〈L, S〉 be a deductive system. An S -secrecy logic is a quadruple K = 〈FmL(V ),K,B, S〉 , where FmL(V ) is the algebra of L-formulas, K,B are S -theories, with B ⊆ K and S ⊆ K such that S ∩ B = ∅ . K corresponds to information deducible from a knowledge base, B to information deducible from the publicly accessible (or browsable) part of the knowledge base and S is a secret set, a set of s...

Secrecy Types for Asymmetric Communication

We develop a typed process calculus for security protocols in which types convey secrecy properties. We focus on asymmetric communication primitives, especially on public-key encryption. These present special dif-culties, partly because they rely on related capabilities (e.g., \public" and \private" keys) with diierent levels of secrecy and scopes.

Secrecy-Preserving Reasoning using Secrecy Envelopes

Inmany applications of networked information systems, the need to share information often has to be balanced against the need to protect secret information from unintended disclosure, e.g., due to copyright, privacy, security, or commercial considerations. We study the problem of secrecy-preserving reasoning, that is, answering queries using secret information, whenever it is possible to do so,...

Strong Secrecy for Wireless Channels

Recent theoretical a potential to signifi information-theoreti concerns, which we community that a s bits from a block o protected data. Even information bits can information-theoreti weak notion of secre ultimate secrecy ra namely one which b bridge the existing security, we present criterion. As in the formulation. The ex